Dynamic Programming for Fractional Discrete-Time Systems
نویسندگان
چکیده
Abstract: Dynamic programming problem for fractional discrete-time systems with quadratic performance index has been formulated and solved. A new method for numerical computation of optimal dynamic programming problem has been presented. The efficiency of the method has been demonstrated on numerical example and illustrated by graphs. Graphs also show the differences between the fractional and integer-order systems theory. Results for other cases of the coefficient α, and not illustrated with numerical examples, have been obtained through a computer algorithm written for this purpose
منابع مشابه
Finite Time Mix Synchronization of Delay Fractional-Order Chaotic Systems
Chaos synchronization of coupled fractional order differential equation is receiving increasing attention because of its potential applications in secure communications and control processing. The aim of this paper is synchronization between two identical or different delay fractional-order chaotic systems in finite time. At first, the predictor-corrector method is used to obtain the solutions ...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملControl of discrete-time HMM partially observed under fractional Gaussian noises
A discrete-time control problem of a finite-state hidden Markov chain partially observed in a fractional Gaussian process is discussed using filtering. The control problem is then recast as a separated problem with information variables given by the unnormalized conditional probabilities of the whole path of the hidden Markov chain. A dynamic programming result and a minimum principle are obtai...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملA Defined Benefit Pension Fund ALM Model through Multistage Stochastic Programming
We consider an asset-liability management (ALM) problem for a defined benefit pension fund (PF). The PF manager is assumed to follow a maximal fund valuation problem facing an extended set of risk factors: due to the longevity of the PF members, the inflation affecting salaries in real terms and future incomes, interest rates and market factors affecting jointly the PF liability and asset p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014